GATE CSE 2017 SET-2
Q41.
Given the following binary number in 32-bit (single precision) IEEE-754 format: 00111110011011010000000000000000 The decimal value closest to this floating- point number isQ42.
For any discrete random variable X, with probability mass function P(X=j)=p_{j}, p_{j}\geq 0, j \in \{0,....N\} and \sum_{j=0}^{N}p_{j}=1, define the polynomial function g_{x}(z)=\sum_{j=0}^{N}p_{j}z^{j}. For a certain discrete random variable Y, there exists a scalar \beta \in [0,1] such that g_{Y}(z)=(1-\beta +\beta z)^{N}. The expectation of Y isQ43.
P and Q are considering to apply for a job. The probability that P applies for the job is 1/4. The probability that P applies for the job given that Q applies for the job is 1/2 , and the probability that Q applies for the job given that P applies for the job 1/3. Then the probability that P does not apply for the job given that Q does not apply for the job isQ44.
Consider the following statements about the routing protocols, Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) in an IPv4 network. I. RIP uses distance vector routing II. RIP packets are sent using UDP III. OSPF packets are sent using TCP IV. OSPF operation is based on link-state routing Which of the statements above are CORRECT?Q45.
The maximum number of IPv4 router addresses that can be listed in the record route (RR) option field of an IPv4 header is _________.Q46.
Let p, q, r denote the statements "It is raining ," It is cold", and " It is pleasant," respectively. Then the statement "It is not raining and it is pleasant, and it is not pleasant only if it is raining and it is cold" is represented byQ47.
A circular queue has been implemented using a single linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operation can be performed in O (1) time ? I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.Q48.
Consider the recurrence function T(n)=\left\{\begin{matrix} 2T(\sqrt{n})+1, & n \gt 2\\ 2,& 0 \lt n\leq 2 \end{matrix}\right. Then T(n) in terms of \theta notation isQ49.
Consider the following database table named top_scorer. Consider the following SQL query: The number of tuples returned by the above SQL query is ___________.Q50.
Which of the following is/are shared by all the threads in a process ? I. Program counter II. Stack III. Address space IV. Registers